The classical-input quantum-output (cq) wiretap channel is a communicationmodel involving a classical sender $X$, a legitimate quantum receiver $B$, anda quantum eavesdropper $E$. The goal of a private communication protocol thatuses such a channel is for the sender $X$ to transmit a message in such a waythat the legitimate receiver $B$ can decode it reliably, while the eavesdropper$E$ learns essentially nothing about which message was transmitted. The$\varepsilon $-one-shot private capacity of a cq wiretap channel is equal tothe maximum number of bits that can be transmitted over the channel, such thatthe privacy error is no larger than $\varepsilon\in(0,1)$. The present paperprovides a lower bound on the $\varepsilon$-one-shot private classicalcapacity, by exploiting the recently developed techniques of Anshu,Devabathini, Jain, and Warsi, called position-based coding and convexsplitting. The lower bound is equal to a difference of the hypothesis testingmutual information between $X$ and $B$ and the "alternate" smoothmax-information between $X$ and $E$. The one-shot lower bound then leads to anon-trivial lower bound on the second-order coding rate for private classicalcommunication over a memoryless cq wiretap channel.
展开▼
机译:经典输入量子输出(cq)窃听通道是一种通信模型,涉及经典发送者$ X $,合法量子接收者$ B $和量子窃听者$ E $。使用这种信道的专用通信协议的目的是使发送方$ X $以某种方式发送消息,使得合法接收方$ B $可以可靠地对其进行解码,而窃听者$ E $基本上不了解哪个消息是传输。 cq窃听通道的$ \ varepsilon $一次私有容量等于可以在该通道上传输的最大位数,因此隐私错误不大于$ \ varepsilon \ in(0,1)$ 。本文通过利用最近开发的Anshu,Devabathini,Jain和Warsi技术(基于位置的编码和凸拆分),提供了$ \ varepsilon $一次性私有古典容量的下限。下限等于$ X $和$ B $之间的假设检验互信息与$ X $和$ E $之间的“替代” moothmax信息之差。然后,单次触发的下限导致在无记忆cq窃听通道上进行私有经典通信的二阶编码率的非平凡下限。
展开▼